Is “Time” Speeding up?

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speeding Up Network Simulations Using Discrete Time

We develop a way of simulating disease spread in networks faster at the cost of some accuracy. Instead of a discrete event simulation (DES) we use a discrete time simulation. This aggregates events into time periods. We prove a bound on the accuracy attained. We also discuss the choice of step size and do an analytical comparison of the computational costs. Our error bound concept comes from th...

متن کامل

Speeding Up Reaction Time with Invisible Stimuli

Normal subjects react more quickly to a pair of visual stimuli than to a stimulus alone. This phenomenon is known as the redundant signal effect (RSE) and represents an example of divided visual attention in which signal processing is carried out in parallel to the advantage of response speed. A most interesting aspect of this phenomenon is that it can occur when one stimulus in a pair cannot b...

متن کامل

Speeding up snakes

In this paper we summarize new and existing approaches for the semiautomatic image segmentation based on active contour models. In order to replace the manual segmentation of images of the medical research of the Center of Anatomy at the Georg August University of Göttingen we developed a user interface based on snakes. Due to the huge images (sometimes bigger than 100 megapixels) the research ...

متن کامل

Speeding up Dynamic Programming

A number of important computational problems in molecular biology, geology, speech recognition, and other areas, can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, we speed up the computation of several of these recurrences by one or two orders...

متن کامل

Speeding up QUAD

QUAD is a provable secure stream cipher based on multivariate polynomials which was proposed in 2006 by Berbain, Gilbert and Patarin [1]. In this paper we show how to speed up QUAD over GF(256) by a factor of up to 5.8. We get this by using structured systems of polynomials, in particular partially circulant polynomials and polynomials generated by a linear recurring sequence (LRS), instead of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: OALib

سال: 2016

ISSN: 2333-9721,2333-9705

DOI: 10.4236/oalib.1103196